Scaling limits for closed product-form queueing networks

نویسندگان

چکیده

We consider a general class of closed product-form queueing networks, consisting single-server queues and infinite-server queues. Even if network is type, performance evaluation tends to be difficult due the potentially large state space dependence between individual To remedy this, we analyze model in Halfin–Whitt inspired scaling regime, where jointly blow up traffic loads all number customers network. This leads closed-form limiting stationary distribution, which provides intuition on impact network’s behavior. assess practical applicability our results through series numerical experiments, illustrate convergence show how parameters can chosen obtain accurate approximations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Product Form Queueing Networks

Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a powerful and versatile tool for system performance evaluation and prediction. Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorit...

متن کامل

Alternative Parameterizations of Product-Form Queueing Networks

product-form queueing networks are considered which allow for conceptual job initiations and terminations (such as a central server model). It is shown that the product-form expression can be parameterized with either mean job resource usages, total server busy times, or overall server utilizations. Measurement and computational efficiencies resulting from these alternative parameterizations ar...

متن کامل

Product Form Queueing Petri Nets: A Combination of Product Form Queueing Networks and Product Form Stochastic Petri Nets

The product form results recently published for Stochastic Petri Nets are combined with the well known product form results for Queueing Networks in the model formalism of Queueing Petri Nets yielding the class of product form Queueing Petri Nets. This model class includes Stochastic Petri Nets with product form solution and BCMP Queueing Networks as special cases. We introduce an arrival theor...

متن کامل

A convolution algorithm for product-form queueing networks with blocking

Queueing network models with finite capacity and blocking can be used to represent various systems with finite resources, including communication and computer systems, as well as production and manufacturing systems to evaluate their performance. Various blocking types have been defined to represent various system behaviors. Queueing networks with blocking show a product-form solution under spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Performance Evaluation

سال: 2021

ISSN: ['0166-5316', '1872-745X']

DOI: https://doi.org/10.1016/j.peva.2021.102220